翻訳と辞書 Words near each other ・ Linear least squares ・ Linear least squares (mathematics) ・ Linear Lie algebra ・ Linear logic ・ Linear low-density polyethylene ・ Linear map ・ Linear matrix inequality ・ Linear medium ・ Linear Men ・ Linear model ・ Linear model of innovation ・ Linear molecular geometry ・ Linear motion ・ Linear motor ・ Linear Motor Girl ・ Linear multistep method ・ Linear network coding ・ Linear no-threshold model ・ Linear octree ・ Linear optical quantum computing ・ Linear parameter-varying control ・ Linear park ・ Linear Park Arts Discovery Trail ・ Linear partial information ・ Linear particle accelerator ・ Linear phase ・ Linear polarization ・ Linear Pottery culture ・ Linear prediction ・ Linear predictive analysis Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Linear multistep method ： ウィキペディア英語版 Linear multistep method Linear multistep methods are used for the numerical solution of ordinary differential equations. Conceptually, a numerical method starts from an initial point and then takes a short step forward in time to find the next solution point. The process continues with subsequent steps to map out the solution. Single-step methods (such as Euler's method) refer to only one previous point and its derivative to determine the current value. Methods such as Runge–Kutta take some intermediate steps (for example, a half-step) to obtain a higher order method, but then discard all previous information before taking a second step. Multistep methods attempt to gain efficiency by keeping and using the information from previous steps rather than discarding it. Consequently, multistep methods refer to several previous points and derivative values. In the case of ''linear'' multistep methods, a linear combination of the previous points and derivative values is used. == Definitions == Numerical methods for ordinary differential equations approximate solutions to initial value problems of the form : $y\text{'}\; =\; f(t,y),\; \backslash quad\; y(t\_0)\; =\; y\_0.$ The result is approximations for the value of $y(t)$ at discrete times $t\_i$: : $y\_i\; \backslash approx\; y(t\_i)\; \backslash quad\backslash text\backslash quad\; t\_i\; =\; t\_0\; +\; i\; h,$ where $h$ is the time step (sometimes referred to as $\backslash Delta\; t$) and $i$ is an integer. Multistep methods use information from the previous $s$ steps to calculate the next value. In particular, a ''linear'' multistep method uses a linear combination of $y\_i$ and $f(t\_i,y\_i)$ to calculate the value of $y$ for the desired current step. Thus, a linear multistep method is a method of the form : $\backslash begin$ & y_ + a_ \cdot y_ + a_ \cdot y_ + \cdots + a_0 \cdot y_n \\ & \qquad ) + b_ \cdot f(t_,y_) + \cdots + b_0 \cdot f(t_n,y_n) \right), \end The coefficients $a\_0,\; \backslash dotsc,\; a\_$ and $b\_0,\; \backslash dotsc,\; b\_s$ determine the method. The designer of the method chooses the coefficients, balancing the need to get a good approximation to the true solution against the desire to get a method that is easy to apply. Often, many coefficients are zero to simplify the method. One can distinguish between explicit and implicit methods. If $b\_s\; =\; 0$, then the method is called "explicit", since the formula can directly compute $y\_$. If $b\_s\; \backslash ne\; 0$ then the method is called "implicit", since the value of $y\_$ depends on the value of $f(t\_,\; y\_)$, and the equation must be solved for $y\_$. Iterative methods such as Newton's method are often used to solve the implicit formula. Sometimes an explicit multistep method is used to "predict" the value of $y\_$. That value is then used in an implicit formula to "correct" the value. The result is a predictor–corrector method. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Linear multistep method」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.